Constructing a Hermitian Matrix from Its Diagonal Entries and Eigenvalues

نویسنده

  • Moody T. Chu
چکیده

Given two vectors a; 2 Rn, the Schur-Horn theorem states that a majorizes if and only if there exists a Hermitian matrix H with eigenvalues and diagonal entries a. While the theory is regarded as classical by now, the known proof is not constructive. To construct a Hermitian matrix from its diagonal entries and eigenvalues therefore becomes an interesting and challenging inverse eigenvalue problem. Two algorithms for determining the matrix numerically are proposed in this paper. The lift and projection method is an iterative method which involves an interesting application of the Wielandt-Ho man theorem. The projected gradient method is a continuous method which, besides its easy implementation, o ers a new proof of existence because of its global convergence property.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Constructing Matrices with Prescribed Singular Values and Diagonal Elements

Similar to the well known Schur Horn theorem that characterizes the relationship between the diagonal entries and the eigenvalues of a Hermitian matrix the Sing Thompson theorem characterizes the relationship between the diagonal en tries and the singular values of an arbitrary matrix It is noted in this paper that based on the induction principle such a matrix can be constructed numerically by...

متن کامل

Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum

In this paper, we present new algorithms that can replace the diagonal entries of a Hermitian matrix by any set of diagonal entries that majorize the original set without altering the eigenvalues of the matrix. They perform this feat by applying a sequence of (N − 1) or fewer plane rotations, where N is the dimension of the matrix. Both the Bendel–Mickey and the Chan–Li algorithms are special c...

متن کامل

Matrix Reconstruction with Prescribed Diagonal Elements, Eigenvalues, and Singular Values

DIAGONAL ELEMENTS, EIGENVALUES, AND SINGULAR VALUES DRAFT AS OF April 30, 2013 SHENG-JHIH WU AND MOODY T. CHU Abstract. Diagonal entries and eigenvalues of a Hermitian matrix, diagonal entries and singular values of a general matrix, and eigenvalues and singular values of a general matrix satisfy necessarily some majorization relationships which turn out also to be sufficient conditions. The in...

متن کامل

Real symmetric matrices 1 Eigenvalues and eigenvectors

A matrix D is diagonal if all its off-diagonal entries are zero. If D is diagonal, then its eigenvalues are the diagonal entries, and the characteristic polynomial of D is fD(x) = ∏i=1(x−dii), where dii is the (i, i) diagonal entry of D. A matrix A is diagonalisable if there is an invertible matrix Q such that QAQ−1 is diagonal. Note that A and QAQ−1 always have the same eigenvalues and the sam...

متن کامل

The largest eigenvalue of finite rank deformation of large Wigner matrices: convergence and non-universality of the fluctuations

In this paper, we investigate the asymptotic spectrum of complex or real Deformed Wigner matrices (MN)N defined by MN = WN/ √ N + AN where WN is a N × N Hermitian (resp. symmetric) Wigner matrix whose entries have a symmetric law satisfying a Poincaré inequality. The matrix AN is Hermitian (resp. symmetric) and deterministic with all but finitely many eigenvalues equal to zero. We first show th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 16  شماره 

صفحات  -

تاریخ انتشار 1995